A conditional time-intervals formulation of the real-time Railway Traffic Management Problem

This paper tackles the real-time Railway Traffic Management Problem (rtRTMP). It is problem of finding optimal choices for train schedules and routes to minimize delays due conflicts. We present a new Constraint Programming (CP) algorithm rtRTMP. The formulation at basis this exploits concept conditional time-interval variables provided in CP Optimizer library. A variable assumes value representing either time interval which an activity executed, or quantity “⊥” indicating that non-executed. kind variables, specific constraint propagation techniques contribute efficiency algorithm. assessed wide experimental analysis based on five railway control areas. performance compared one state-of-the-art RECIFE-MILP mixed-integer linear programming (MILP) formulation. Moreover, hybridization proposed proposed. often outperforms two individual approaches, while opposite never happens.